Minimum cost b-matching problems with neighborhoods

Abstract In this paper, we deal with minimum cost b -matching problems on graphs where the nodes are assumed to belong non-necessarily convex regions called neighborhoods, and costs given by distances between points of neighborhoods. The goal in proposed is twofold: (i) finding a graph (ii) determining point each neighborhood be connection among edges defining b-matching. Different variants problem considered depending criteria match neighborhoods: perfect, maximum cardinality, maximal – problems. theoretical complexity solving one these analyzed. mixed integer non-linear programming formulations for then reformulated as Second Order Cone formulations. An extensive computational experience shows efficiency solve under study.